Bounding Cache Miss Costs of Multithreaded Computations Under General Schedulers

We analyze the caching overhead incurred by a class of multithreaded algorithms when scheduled by an arbitrary scheduler. We obtain bounds that match or improve upon the well-known $O(Q+S \cdot (M/B))$ caching cost for the randomized work stealing (RWS) scheduler, where $S$ is the number of steals, $Q$ is the sequential caching cost, and $M$ and $B$ are the cache size and block (or cache line) size respectively.Comment: Extended abstract in Proceedings of ACM Symp. on Parallel Alg. and Architectures (SPAA) 2017, pp. 339-350. This revision has a few small updates including a missing citation and the replacement of some big Oh terms with precise constant

Can the Mortonson-Pissarides matching model match the business cycle facts?

We examine whether the Mortensen-Pissarides matching model can account for the business cycle facts on employment, job creation, and job destruction. A novel feature of our analysis is its emphasis on the reduced-form implications of the matching model. Our main finding is that the model can account for the business cycle facts, but only if the average duration of a nonemployment spell is relatively high—about nine months or longer.Business cycles